An Algorithm for Isolating the Real Solutions of Piecewise Algebraic Curves
نویسندگان
چکیده
The piecewise algebraic curve, as the set of zeros of a bivariate spline function, is a generalization of the classical algebraic curve. In this paper, an algorithm is presented to compute the real solutions of two piecewise algebraic curves. It is primarily based on the Krawczyk-Moore iterative algorithm and good initial iterative interval searching algorithm. The proposed algorithm is relatively easy to implement.
منابع مشابه
Piecewise Approximations of Real Algebraic Surfaces
We use a combination of both symbolic and numerical techniques to construct several degree bounded G 0 and G 1 continuous, piecewise approximations of real algebraic surfaces. These approximations are based upon an adaptive triangulation (a G 0 planar approximation) of the real components of the algebraic surface, and includes both singular points and singular curves on the surface. The approxi...
متن کاملAn integrated heuristic method based on piecewise regression and cluster analysis for fluctuation data (A case study on health-care: Psoriasis patients)
Trend forecasting and proper understanding of the future changes is necessary for planning in health-care area.One of the problems of analytic methods is determination of the number and location of the breakpoints, especially for fluctuation data. In this area, few researches are published when number and location of the nodes are not specified.In this paper, a clustering-based method is develo...
متن کاملOn the complexity of computing with planar algebraic curves
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following problems can be solved in a deterministic ...
متن کاملImproved Complexity Bounds for Computing with Planar Algebraic Curves
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following problems can be solved in a deterministic ...
متن کاملOn the Quaternionic Curves in the Semi-Euclidean Space E_4_2
In this study, we investigate the semi-real quaternionic curves in the semi-Euclidean space E_4_2. Firstly, we introduce algebraic properties of semi-real quaternions. Then, we give some characterizations of semi-real quaternionic involute-evolute curves in the semi-Euclidean space E42 . Finally, we give an example illustrated with Mathematica Programme.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Mathematics
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011